Learning Plackett-Luce Mixtures from Partial Preferences
نویسندگان
چکیده
منابع مشابه
Learning Mixtures of Plackett-Luce Models
In this paper we address the identifiability and efficient learning problem of finite mixtures of Plackett-Luce models for rank data. We prove that for any k ≥ 2, the mixture of k PlackettLuce models for no more than 2k−1 alternatives is non-identifiable and this bound is tight for k = 2. For generic identifiability, we prove that the mixture of k Plackett-Luce models over m alternatives is gen...
متن کاملPlackett-Luce Networks for Dyad Ranking
We propose a new method for dyad ranking, a problem that was recently introduced in the realm of preference learning. Our method, called PLNet, combines a statistical model for rank data, namely the Plackett-Luce model, with neural networks (feed-forward multi-layer perceptrons) in order to learn joint-feature representations for dyads, which are pairs of objects from two domains. The efficacy ...
متن کاملBayesian nonparametric Plackett-Luce models for the analysis of preferences for college degree programmes
In this paper we propose a Bayesian nonparametric model for clustering partial ranking data. We start by developing a Bayesian nonparametric extension of the popular Plackett–Luce choice model that can handle an infinite number of choice items. Our framework is based on the theory of random atomic measures, with the prior specified by a completely random measure. We characterise the posterior d...
متن کاملA Latent-Feature Plackett-Luce Model for Dyad Ranking Completion
Dyad ranking is a specific type of preference learning problem, namely the problem of learning a model that is capable of ranking a set of feature vector pairs, called dyads. In this paper a situation is considered where feature vectors consists of identifiers only. A new method based on learning latent-features is introduced for this purpose. The method is evaluated on synthetic data and is ap...
متن کاملFast and Accurate Inference of Plackett–Luce Models Supplementary Material
1 Stationary Points of the Log-Likelihood In this section, we briefly explain why the log-likelihood in Luce's model has a unique stationary point, that at the ML estimate. Recall that we assume that the comparison graph G D is strongly connected. The log-likelihood is given by
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33014328